package com.leetcode.demo3Solution.JianOffer;

import javax.swing.tree.TreeNode;

/**
 * @description:输入一棵二叉树的根节点，求该树的深度。从根节点到叶节点依次经过的节点（含根、叶节点）形成树的一条路径，最长路径的长度为树的深度。
 * @author: tutu
 **/

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class offer55_1113 {
    public static void main(String[] args) {
       System.out.println("shitutuya:");
    }
}

